Current trends and open problems in arithmetic dynamics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Serverless Computing: Current Trends and Open Problems

Serverless computing has emerged as a new compelling paradigm for the deployment of applications and services. It represents an evolution of cloud programming models, abstractions, and platforms, and is a testament to the maturity and wide adoption of cloud technologies. In this chapter, we survey existing serverless platforms from industry, academia, and open source projects, identify key char...

متن کامل

Self-similar fractals and arithmetic dynamics

‎The concept of self-similarity on subsets of algebraic varieties‎ ‎is defined by considering algebraic endomorphisms of the variety‎ ‎as `similarity' maps‎. ‎Self-similar fractals are subsets of algebraic varieties‎ ‎which can be written as a finite and disjoint union of‎ ‎`similar' copies‎. ‎Fractals provide a framework in which‎, ‎one can‎ ‎unite some results and conjectures in Diophantine g...

متن کامل

Current trends and problems in health screening1

SYNOPSIS Automation in clinical chemistry is a powerful tool. Like most innovations it is posing many questions as well as resolving some. Its use in population screening has led to questioning the validity of the old system of 'normal values' and to the search for better methods of indicating the significance of laboratory tests. This in itself is likely to have a good effect in that it is lea...

متن کامل

Refactoring: Emerging Trends and Open Problems

This position paper identifies emerging trends in refactoring research, and enumerates a list of open questions, from a practical as well as a theoretical point of view. We suggest these directions for further research based on our own experience with refactoring, as well as on a detailed literature survey on software refactoring.

متن کامل

Some open problems in bounded arithmetic and propositional proof complexity

The broad relevance and importance of bounded arithmetic and propositional proof complexity are well appreciated; these subjects are two of three which are interconnected in various and interesting ways, the third subject being computational complexity theory. This latter area is rife with old, well-established open problems and one good way to get at them is by studying the other two, whose pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 2019

ISSN: 0273-0979,1088-9485

DOI: 10.1090/bull/1665